User model

Results: 1475



#Item
1Mathematical logic / Type theory / Computability theory / Lambda calculus / Theoretical computer science / Model theory / Higher-order logic / Constructible universe / Mathematics

Bounded Model Generation for Isabelle/HOL Using a SAT Solver Tjark Weber

Add to Reading List

Source URL: user.it.uu.se

Language: English - Date: 2005-09-13 07:35:24
2Computing / Computer programming / Concurrent computing / Concurrency control / Parallel computing / Thread / Linearizability / C++11 / POSIX Threads / Lock / Concurrency / Go

C/C++ Concurrency: Formalization and Model Finding Mark Batty Jasmin Blanchette Susmit Sarkar Peter Sewell

Add to Reading List

Source URL: user.it.uu.se

Language: English - Date: 2013-09-25 05:49:39
3Mathematical logic / Computability theory / Type theory / Theoretical computer science / Metalogic / Model theory / Lambda calculus / Constructible universe / Mathematics

SAT-based Finite Model Generation for Isabelle/HOL Tjark Weber Summer School Marktoberdorf, August 9, 2005

Add to Reading List

Source URL: user.it.uu.se

Language: English - Date: 2005-09-13 07:36:34
4Mathematical logic / Logic / Boolean algebra / Mathematics / Classical logic / Propositional calculus / Model theory

Introduction Finite Model Generation Extensions and Optimizations Case Studies Integration of Proof-Producing SAT Solvers Conclusion

Add to Reading List

Source URL: user.it.uu.se

Language: English - Date: 2008-10-09 08:41:17
5Computing / Software engineering / Concurrent computing / Concurrency control / C++ / Parallel computing / Transaction processing / Concurrency / Linearizability / C++11 / Thread / POSIX Threads

The C/C++ Memory Model: Overview and Formalization Mark Batty Jasmin Blanchette Susmit Sarkar Peter Sewell

Add to Reading List

Source URL: user.it.uu.se

Language: English - Date: 2015-05-22 10:51:47
6Computability theory / Lambda calculus / Theoretical computer science / Model theory / Higher-order logic / Constructible universe / Metaphilosophy / Mathematics

Bounded Model Generation for Isabelle/HOL and Related Applications of SAT Solvers in Interactive Theorem Proving Tjark Weber

Add to Reading List

Source URL: user.it.uu.se

Language: English - Date: 2005-09-13 07:36:16
7Theoretical computer science / Logic / Mathematical logic / Logic in computer science / Formal methods / Electronic design automation / NP-complete problems / Constraint programming / Satisfiability modulo theories / Satisfiability / Propositional calculus / Solver

Introduction Finite Model Generation Proof-Producing SAT Solvers Satisfiability Modulo Theories Finite Model Generation, Proof-Producing

Add to Reading List

Source URL: user.it.uu.se

Language: English - Date: 2009-02-03 09:54:08
8

World Converter Model WC-01 User and Technical Manual

Add to Reading List

Source URL: www.tech-retro.com

Language: English - Date: 2018-07-02 21:38:55
    9

    The final publication is available at Springer via http://dx.doi.orgs11241Schedulability Analysis of a Graph-Based Task Model for Mixed-Criticality Systems Pontus Ekberg ยท Wang Yi

    Add to Reading List

    Source URL: user.it.uu.se

    Language: English - Date: 2015-08-11 07:31:16
      10

      Model Checking Continuous-time Duration Calculus Against Bounded Behaviour of Timed Automata ABSTRACT Extended Linear Duration Invariants (ELDIs), an important subset of Duration Calculus, extends well-studied Linear Dur

      Add to Reading List

      Source URL: user.it.uu.se

      Language: English - Date: 2017-12-22 10:05:56
        UPDATE